Applications of Ordinal Ranks to Flexible Query Answering
نویسندگان
چکیده
Exact querying and retrieving relevant data from a database is a difficult task. We present an approach for flexibly answering algebraic queries using an extension of Codd’s relational model with ordinal ranks based on residuated lattices and similarities on attribute domains.
منابع مشابه
Flexible Query Answering Using Distance-Based Fuzzy Relations
This paper addresses the added value that is provided by using distance-based fuzzy relations in flexible query answering. To use distances and/or concepts of gradual similarity in that domain is not new. Within the last ten years, however, results in the theory of fuzzy relations have emerged that permit a smooth and pragmatic, yet expressive and effective, integration of ordinal concepts too....
متن کاملSensitivity Analysis for Declarative Relational Query Languages with Ordinal Ranks
We present sensitivity analysis for results of query executions in a relational model of data extended by ordinal ranks. The underlying model of data results from the ordinary Codd’s model of data in which we consider ordinal ranks of tuples in data tables expressing degrees to which tuples match queries. In this setting, we show that ranks assigned to tuples are insensitive to small changes, i...
متن کاملILCR: Item-based Latent Factors for Sparse Collaborative Retrieval
Interactions between search and recommendation have recently attracted significant attention, and several studies have shown that many potential applications involve with a joint problem of producing recommendations to users with respect to a given query, termed Collaborative Retrieval (CR). Successful algorithms designed for CR should be potentially flexible at dealing with the sparsity challe...
متن کاملBorel Subgroups of Polish Groups
We study three classes of subgroups of Polish groups: Borel subgroups, Polishable subgroups, and maximal divisible subgroups. The membership of a subgroup in each of these classes allows one to assign to it a rank, that is, a countable ordinal, measuring in a natural way complexity of the subgroup. We prove theorems comparing these three ranks and construct subgroups with prescribed ranks. In p...
متن کاملBoosting Passage Retrieval through Reuse in Question Answering
Question Answering (QA) is an emerging important field in Information Retrieval. In a QA system the archive of previous questions asked from the system makes a collection full of useful factual nuggets. This paper makes an initial attempt to investigate the reuse of facts contained in the archive of previous questions to help and gain performance in answering future related factoid questions. I...
متن کامل